-
KClist++: A Simple Algorithm for Finding k-Clique DensestSubgraphs in Large Graphs
Maximilien Danisch, T-H. Hubert Chan, Mauro Sozio, Bintao Sun
Graph mining, Graph algorithmics
VLDB2020
-
LouvainNE: Hierarchical Louvain Method for High Quality and Scalable Network Embedding
Maximilien Danisch, Jean-Loup Guillaume, Ayan K. Bhowmick, Koushik Meneni, Bivas Mitra
Graph algorithmics, graph embeddings
WSDM2020
-
Finding Heaviest k -Subgraphs and Events in Social Media
Maximilien Danisch, Mauro Sozio, Matthaios Letsios, Oana Denisa Balalau, Emmanuel Orsini
Graph mining
Real-world graphs, Densest-k-Subgraph, Branch and bound
-
Listing k-cliques in Sparse Real-World Graphs
Maximilien Danisch, Mauro Sozio, Oana Balalau
Graph algorithmics
Real-world graph algorithmics
-
Large Scale Density-friendly Graph Decomposition via Convex Programming
Maximilien Danisch, T-H. Hubert Chan, Mauro Sozio
Graph mining
Real-world graphs, Density friendly, Densest subgraph, Frank-Wolfe algorithm
-
A Modular Overlapping Community Detection Algorithm: Investigating the “From Local to Global” Approach
Maximilien Danisch, Noé Gaumont, Jean-Loup Guillaume
Graph mining
community detection, Real-world graph algorithmics